On auto-correlation values of de Bruijn sequences
نویسندگان
چکیده
منابع مشابه
On extending de Bruijn sequences
An indirect proof of part of Theorem 1 was first given by Leach in [11] with a topological and measure-theoretic argument on the set of real numbers corresponding to limits of frequency distribution sequences. In [7] Flaxman et al. use the graph-theoretical characterization of de Bruijn sequences to show that the extensions always exist in alphabets with at least three symbols. However, their p...
متن کاملCorrelation of Pseudorandom Binary Sequences from de Bruijn Graphs
Binary sequences with good correlation properties play an important role in many secure communication systems and testing of systems. In this paper, we describe and illustrate sets of pseudorandom sequences from de Bruijn graphs which have good correlation functions and critically analyze how we investigate all homomorphisms that give low correlation values between the binary sequences. We comp...
متن کاملDe Bruijn Sequences Revisited
A (non-circular) de Bruijn sequence w of order n is a word such that every word of length n appears exactly once in w as a factor. In this paper, we generalize the concept to different settings: the multi-shift de Bruijn sequence and the pseudo de Bruijn sequence. An m-shift de Bruijn sequence of order n is a word such that every word of length n appears exactly once in w as a factor that start...
متن کاملEnumerating De Bruijn Sequences
A cycle is a sequence taken in a circular order—that is, follows , and are all the same cycle as . Given natural numbers and , a cycle of letters is called a complete cycle [1, 2], or De Bruijn sequence, if subsequences consist of all possible ordered sequences over the alphabet . In 1946, De Bruijn proved [1] (see [2]) that the number of complete cycles, under , is equal to . We propose the ov...
متن کاملDe Bruijn Graph Homomorphisms and Recursive De Bruijn Sequences
This paper presents a method to find new de Bruijn cycles based on ones of lesser order. This is done by mapping a de Bruijn cycle to several vertex disjoint cycles in a de Bruijn digraph of higher order and connecting these cycles into one full cycle. We characterize homomorphisms between de Bruijn digraphs of different orders that allow this construction. These maps generalize the well-known ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nonlinear Theory and Its Applications, IEICE
سال: 2011
ISSN: 2185-4106
DOI: 10.1587/nolta.2.400